Technical appendix to “Adaptive estimation of covariance matrices via Cholesky decomposition”

نویسنده

  • Nicolas Verzelen
چکیده

This is a technical appendix to “Adaptive estimation of covariance matrices via Cholesky decomposition (arXiv:1010.1445). AMS 2000 subject classifications: Primary 62H12; secondary 62F35, 62J05.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive estimation of covariance matrices via Cholesky decomposition

This paper studies the estimation of a large covariance matrix. We introduce a novel procedure called ChoSelect based on the Cholesky factor of the inverse covariance. This method uses a dimension reduction strategy by selecting the pattern of zero of the Cholesky factor. Alternatively, ChoSelect can be interpreted as a graph estimation procedure for directed Gaussian graphical models. Our appr...

متن کامل

Sparse Estimation of Large Covariance Matrices via a Nested Lasso Penalty by Elizaveta Levina,1 Adam Rothman

The paper proposes a new covariance estimator for large covariance matrices when the variables have a natural ordering. Using the Cholesky decomposition of the inverse, we impose a banded structure on the Cholesky factor, and select the bandwidth adaptively for each row of the Cholesky factor, using a novel penalty we call nested Lasso. This structure has more flexibility than regular banding, ...

متن کامل

Sparse Estimation of Large Covariance Matrices via a Nested Lasso Penalty

The paper proposes a new covariance estimator for large covariance matrices when the variables have a natural ordering. Using the Cholesky decomposition of the inverse, we impose a banded structure on the Cholesky factor, and select the bandwidth adaptively for each row of the Cholesky factor, using a novel penalty we call nested Lasso. This structure has more flexibility than regular banding, ...

متن کامل

Covariance selection and estimation via penalised normal likelihood

We propose a nonparametric method to identify parsimony and to produce a statistically efficient estimator of a large covariance matrix. We reparameterise a covariance matrix through the modified Cholesky decomposition of its inverse or the one-step-ahead predictive representation of the vector of responses and reduce the nonintuitive task of modelling covariance matrices to the familiar task o...

متن کامل

Estimation of Large Covariance Matrices of Longitudinal Data with Basis Function Approximations

The major difficulties in estimating a large covariance matrix are the high dimensionality and the positive definiteness constraint. To overcome these difficulties, we propose to apply smoothing-based regularization and utilize the modified Cholesky decomposition of the covariance matrix. In our proposal, the covariance matrix is diagonalized by a lower triangular matrix, whose subdiagonals are...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017